Asymptotically efficient parameter estimation using quantized output observations
نویسندگان
چکیده
This paper studies identification of systems in which only quantized output observations are available. An identification algorithm for system gains is introduced that employs empirical measures from multiple sensor thresholds and optimizes their convex combinations. Strong convergence of the algorithm is first derived. The algorithm is then extended to a scenario of system identification with communication constraints, in which the sensor output is transmitted through a noisy communication channel and observed after transmission. The main results of this paper demonstrate that these algorithms achieve the Cramér–Rao lower bounds asymptotically, and hence are asymptotically efficient algorithms. Furthermore, under some mild regularity conditions, these optimal algorithms achieve error bounds that approach optimal error bounds of linear sensors when the number of thresholds becomes large. These results are further extended to finite impulse response and rational transfer function models when the inputs are designed to be periodic and full rank. 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
Asymptotically efficient identification of FIR systems with quantized observations and general quantized inputs
This paper introduces identification algorithms for finite impulse response systems under quantized output observations and general quantized inputs. While asymptotically efficient algorithms for quantized identification under periodic inputs are available, their counterpart under general inputs has encountered technical difficulties and evaded satisfactory resolutions. Under quantized inputs, ...
متن کاملDOA Parameter Estimation with 1-bit Quantization Bounds, Methods and the Exponential Replacement
Abstract—While 1-bit analog-to-digital conversion (ADC) allows to significantly reduce the analog complexity of wireless receive systems, using the exact likelihood function of the hardlimiting system model in order to obtain efficient algorithms in the digital domain can make 1-bit signal processing challenging. If the signal model before the quantizer consists of correlated Gaussian random va...
متن کاملRobust distributed maximum likelihood estimation with dependent quantized data
In this paper, distributed maximum likelihood estimation (MLE) with quantized data is considered under the assumption that the structure of the joint probability density function (pdf) is known, but it contains unknown deterministic parameters. The parameters may include different vector parameters corresponding to marginal pdfs and parameters that describe dependence of observations across sen...
متن کاملAsymptotically Efficient Parameter Estimation in Hidden Markov Spatio-temporal Random Fields
Estimation of the parameters of Markov random field models for spatial and temporal data arises in many applications. There are computational and statistical challenges in developing efficient estimators because of the complexity of the joint distribution of the spatio-temporal models, especially when they involve hidden states that also need to be estimated from the observations. We develop co...
متن کاملSignal estimation with binary-valued sensors
This paper introduces several algorithms for signal estimation using binary-valued output sensing. The main idea is derived from the empirical measure approach for quantized identification, which has been shown to be convergent and asymptotically efficient when the unknown parameters are constants. Signal estimation under binary-valued observations must take into consideration of time varying v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 43 شماره
صفحات -
تاریخ انتشار 2007